Decomposing the Secondary Cayley Polytope

نویسندگان

  • T. Michiels
  • Ronald Cools
چکیده

The vertices of the secondary polytope of a point connguration correspond to its regular triangulations. The Cayley trick links triangulations of one point connguration, called the Cayley polytope, to the ne mixed subdivisions of a tuple of point conngurations. In this paper we investigate the secondary polytope of this Cayley polytope. Its vertices correspond to all regular mixed subdivisions of a tuple of point conngurations. We demonstrate that it equals the Minkowski sum of polytopes, which we call mixed secondary polytopes, whose vertices correspond to regular-cell conngurations.ondary polytope, bistellar ip. Abstract. The vertices of the secondary polytope of a point connguration correspond to its regular triangulations. The Cayley trick links triangulations of one point connguration, called the Cayley polytope, to the ne mixed subdivisions of a tuple of point conngurations. In this paper we investigate the secondary polytope of this Cayley polytope. Its vertices correspond to all regular mixed subdivisions of a tuple of point conngurations. We demonstrate that it equals the Minkowski sum of polytopes, which we call mixed secondary polytopes, whose vertices correspond to regular-cell conngurations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CAYLEY DECOMPOSITIONS OF LATTICE POLYTOPES AND UPPER BOUNDS FOR h-POLYNOMIALS

We give an effective upper bound on the h-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem which says, roughly speaking, that any lattice polytope with a large multiple that has no interior lattice points has a nontrivial decomposition as a Cayley su...

متن کامل

3-Dimensional Lattice Polytopes Without Interior Lattice Points

A theorem of Howe states that every 3-dimensional lattice polytope P whose only lattice points are its vertices, is a Cayley polytope, i.e. P is the convex hull of two lattice polygons with distance one. We want to generalize this result by classifying 3-dimensional lattice polytopes without interior lattice points. The main result will be, that they are up to finite many exceptions either Cayl...

متن کامل

Cayley Compactifications of Abelian Groups

Following work of Rieffel [1], in this document we define the Cayley compactification of a discrete group G together with a set of generators S. We use algebraic methods in the general case to construct an explicit presentation of Cayley compactifications. In the particular case of Z, we use geometric methods to demonstrate a strong connection between the Cayley compactification and the polytop...

متن کامل

Classifying Smooth Lattice Polytopes via Toric Fibrations

We show that any smooth Q-normal lattice polytope P of dimension n and degree d is a strict Cayley polytope if n ≥ 2d+ 1. This gives a sharp answer, for this class of polytopes, to a question raised by V. V. Batyrev and B. Nill.

متن کامل

Cayley Compositions, Partitions, Polytopes, and Geometric Bijections

In 1857, Cayley showed that certain sequences, now called Cayley compositions, are equinumerous with certain partitions into powers of 2. In this paper we give a simple bijective proof of this result and a geometric generalization to equality of Ehrhart polynomials between two convex polytopes. We then apply our results to give a new proof of Braun’s conjecture proved recently by the authors [K...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2000